Resurrecting the asymptotics of linear recurrences
نویسندگان
چکیده
منابع مشابه
Resurrecting the Asymptotics of Linear Recurrences *
Once on the forefront of mathematical research in America, the asymptotics of the solutions of linear recurrence equations is now almost forgotten, especially by the people who need it most, namely combinatorists and computer scientists. Here we present this theory in a concise form and give a number of examples that should enable the practicing combinatorist and computer scientist to include t...
متن کاملAsymptotics of Linear Recurrences with Rational Coeecients Asymptotics of Linear Recurrences with Rational Coeecients Asymptotics of Linear Recurrences with Rational Coeecients
We give algorithms to compute the asymptotic expansion of solutions of linear recurrences with rational coeecients and rational initial conditions in polynomial time in the order of the recurrence. Asymptotique des r ecurrences lin eaires a coeecients rationnels R esum e Nous pr esentons des algorithmes pour le calcul du d eveloppement asymptotique des solutions de r ecurrences lin eaires a coe...
متن کاملAsymptotics of linear divide-and-conquer recurrences
Asymptotics of divide-and-conquer recurrences is usually dealt either with elementary inequalities or with sophisticated methods coming from analytic number theory. Philippe Dumas proposes a new approach based on linear algebra. The example of the complexity of Karatsuba’s algorithm is used as a guide in this summary. The complexity analysis of divide-and-conquer algorithms gives rise to recurr...
متن کاملEeective Asymptotics of Linear Recurrences with Rational Coeecients
We give algorithms to compute the asymptotic expansion of solutions of linear recurrences with rational coeecients and rational initial conditions in polynomial time in the order of the recurrence.
متن کاملAsymptotics of Some Convolutional Recurrences
We study the asymptotic behavior of the terms in sequences satisfying recurrences of the form an = an−1 + n−d k=d f(n, k)akan−k where, very roughly speaking, f(n, k) behaves like a product of reciprocals of binomial coefficients. Some examples of such sequences from map enumerations, Airy constants, and Painlevé I equations are discussed in detail. 1 Main results There are many examples in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1985
ISSN: 0022-247X
DOI: 10.1016/0022-247x(85)90209-4